TSTP Solution File: NUM793^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM793^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:58:00 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 33 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 45 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 126 ( 18 ~; 15 |; 0 &; 88 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 ^ 33 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
rat: $tType ).
thf(decl_22,type,
x0: rat ).
thf(decl_23,type,
y0: rat ).
thf(decl_24,type,
z0: rat ).
thf(decl_25,type,
more: rat > rat > $o ).
thf(decl_26,type,
moreis: rat > rat > $o ).
thf(decl_27,type,
less: rat > rat > $o ).
thf(decl_28,type,
lessis: rat > rat > $o ).
thf(satz87a,axiom,
! [X1: rat,X2: rat,X3: rat] :
( ( lessis @ X1 @ X2 )
=> ( ( less @ X2 @ X3 )
=> ( less @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p',satz87a) ).
thf(satz84,axiom,
! [X1: rat,X2: rat] :
( ( moreis @ X1 @ X2 )
=> ( lessis @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p',satz84) ).
thf(satz83,axiom,
! [X1: rat,X2: rat] :
( ( less @ X1 @ X2 )
=> ( more @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p',satz83) ).
thf(n,axiom,
moreis @ y0 @ z0,
file('/export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p',n) ).
thf(satz87d,conjecture,
more @ x0 @ z0,
file('/export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p',satz87d) ).
thf(satz82,axiom,
! [X1: rat,X2: rat] :
( ( more @ X1 @ X2 )
=> ( less @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p',satz82) ).
thf(m,axiom,
more @ x0 @ y0,
file('/export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p',m) ).
thf(c_0_7,plain,
! [X15: rat,X16: rat,X17: rat] :
( ~ ( lessis @ X15 @ X16 )
| ~ ( less @ X16 @ X17 )
| ( less @ X15 @ X17 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz87a])])]) ).
thf(c_0_8,plain,
! [X18: rat,X19: rat] :
( ~ ( moreis @ X18 @ X19 )
| ( lessis @ X19 @ X18 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz84])])]) ).
thf(c_0_9,plain,
! [X1: rat,X2: rat,X3: rat] :
( ( less @ X1 @ X3 )
| ~ ( lessis @ X1 @ X2 )
| ~ ( less @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X1: rat,X2: rat] :
( ( lessis @ X2 @ X1 )
| ~ ( moreis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
! [X13: rat,X14: rat] :
( ~ ( less @ X13 @ X14 )
| ( more @ X14 @ X13 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz83])])]) ).
thf(c_0_12,plain,
! [X3: rat,X2: rat,X1: rat] :
( ( less @ X1 @ X2 )
| ~ ( less @ X3 @ X2 )
| ~ ( moreis @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
moreis @ y0 @ z0,
inference(split_conjunct,[status(thm)],[n]) ).
thf(c_0_14,negated_conjecture,
~ ( more @ x0 @ z0 ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz87d])]) ).
thf(c_0_15,plain,
! [X1: rat,X2: rat] :
( ( more @ X2 @ X1 )
| ~ ( less @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,plain,
! [X1: rat] :
( ( less @ z0 @ X1 )
| ~ ( less @ y0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
! [X20: rat,X21: rat] :
( ~ ( more @ X20 @ X21 )
| ( less @ X21 @ X20 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz82])])]) ).
thf(c_0_18,negated_conjecture,
~ ( more @ x0 @ z0 ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
thf(c_0_19,plain,
! [X1: rat] :
( ( more @ X1 @ z0 )
| ~ ( less @ y0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,plain,
! [X1: rat,X2: rat] :
( ( less @ X2 @ X1 )
| ~ ( more @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
~ ( more @ x0 @ z0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_22,plain,
! [X1: rat] :
( ( more @ X1 @ z0 )
| ~ ( more @ X1 @ y0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,plain,
more @ x0 @ y0,
inference(split_conjunct,[status(thm)],[m]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM793^1 : TPTP v8.1.2. Released v3.7.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 09:27:12 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.5aVGrHb1FT/E---3.1_18053.p
% 0.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.51 # Starting sh4l with 300s (1) cores
% 0.22/0.51 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.51 # sh4l with pid 18176 completed with status 0
% 0.22/0.51 # Result found by sh4l
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.51 # Starting sh4l with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HHUNF-FFSF00-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.51 # new_ho_10 with pid 18183 completed with status 0
% 0.22/0.51 # Result found by new_ho_10
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.51 # Starting sh4l with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HHUNF-FFSF00-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 15
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 15
% 0.22/0.51 # Removed in clause preprocessing : 8
% 0.22/0.51 # Initial clauses in saturation : 7
% 0.22/0.51 # Processed clauses : 18
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 18
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 6
% 0.22/0.51 # ...of the previous two non-redundant : 4
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 6
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 1
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 11
% 0.22/0.51 # Positive orientable unit clauses : 2
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 8
% 0.22/0.51 # Current number of unprocessed clauses: 0
% 0.22/0.51 # ...number of literals in the above : 0
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 7
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 1
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 1
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 0
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 18
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 634
% 0.22/0.51 # Search garbage collected termcells : 91
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.004 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.006 s
% 0.22/0.51 # Maximum resident set size: 1728 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.010 s
% 0.22/0.51 # Maximum resident set size: 1720 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------